Tight Bounds for Adopt-Commit Objects
نویسندگان
چکیده
منابع مشابه
Tight Bounds for Visibility Matching of f-Equal Width Objects
Let s denote a compact convex object in IR. The f-width of s is the perpendicular distance between two distinct parallel lines of support of s with direction f . A set of disjoint convex compact objects in IR is of equal f -width if there exists a direction f such that every pair of objects have equal f -width. A visibility matching, for a set of equal f -width objects is a matching using non-c...
متن کاملTight Bounds for HTN Planning
Although HTN planning is in general undecidable, there are many syntactically identifiable sub-classes of HTN problems that can be decided. For these sub-classes, the decision procedures provide upper complexity bounds. Lower bounds were often not investigated in more detail, however. We generalize a propositional HTN formalization to one that is based upon a function-free first-order logic and...
متن کاملTight bounds for some problems
There are a number of fundamental problems in eomputational geometry for which work-optimal aJgorithDls exist which have a parallel running -fuDe of O(log n) in the PRAM model. These include problems like two and three dimensional convex-hulls, trapeSoidal decomposition, arrangement coDStruc:.tion, dommance among others. Further improvements in running time to sub-logarithmic range were not con...
متن کاملTight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of different colours become more reasonable. They show that an iterative recolouring method converges after a finite, but exponential, number of steps. They also give, as an example, a triangulated point set with a specifi...
متن کاملTight bounds for strategyproof classification
Strategyproof (SP) classification considers situations in which a decision-maker must classify a set of input points with binary labels, minimizing expected error. Labels of input points are reported by self-interested agents, who may lie so as to obtain a classifier more closely matching their own labels. These lies would create a bias in the data, and thus motivate the design of truthful mech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2013
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-013-9448-1